EN5_OA_Heber edit

نویسنده

  • S. Anbalagan
چکیده

Background: Chronic suppurative otitis media is a common problem in our part of the world and few end up with intracranial complication. Brain abscess, meningitis and lateral sinus thrombosis are the most common intracranial complications. Emergency Multi-specialty Intervention can prevent mortality. Aim: The objective of the study is to determine various types of intracranial complications affecting adult population with of Chronic Suppurative Otitis Media with Cholesteatoma in our institution. Methods: All admitted cases of intracranial complications due to chronic suppurative otitis media with cholesteatoma of any age and gender were included. Results: The most common age group was between 11 and 20 years and males were 80% more affected than females. And 90% of patients presented with unilateral disease of ear and 73% of cases had attic pathology. Incidence of intracranial complication in patients with CSOM with cholesteatoma was 1%. The most common complication was brain abscess (20%) followed by meningitis (20%), lateral sinus thrombosis (13.3%) and extradural abscess (16%). Conclusion: Brain abscess is the commonest intracranial complication of chronic suppurative otitis media with cholesteatoma followed by Meningitis. Early surgical intervention in combination with broad spectrum antibiotics provides a good outcome.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)

The edit distance between two rooted ordered trees with n nodes labeled from an alphabet Σ is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. Tree edit distance is a well known generalization of string edit distance. The fastest known algorithm for tree edit dist...

متن کامل

Map Edit Distance vs. Graph Edit Distance for Matching Images

Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another...

متن کامل

A Quadratic Programming Approach to the Graph Edit Distance Problem

In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost edit path between graphs, we introduce the notion of fuzzy edit paths between graphs and provide a quadratic programming formulation for the minimization of fuzzy edit costs. Experiments on real-world graph data demonstr...

متن کامل

An Eecient Uniform-cost Normalized Edit Distance Algorithm

A common model for computing the similarity of two strings X and Y of lengths m, and n respectively with m n, is to transform X into Y through a sequence of edit operations which are of three types: insertion, deletion, and substitution of symbols. The model assumes a given weight function which assigns a non-negative real cost to each of these edit operations. The amortized weight for a given ...

متن کامل

Edit Distance From Graph Spectra

This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the formality and rigour of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that standard string edit distance techniques can be used. To do this we use graph spectral seri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017